Analysis of the postulates produced by Karp's Theorem
نویسنده
چکیده
This is the final article in a series of four articles. Richard Karp has proven that a deterministic polynomial time solution to K-SAT will result in a deterministic polynomial time solution to all NP-Complete problems. However, it is demonstrated that a deterministic polynomial time solution to any NP-Complete problem does not necessarily produce a deterministic polynomial time solution to all NP-Complete problems.
منابع مشابه
. C C ] 2 5 A ug 2 00 8 Analysis of the postulates produced by Karp ’ s Theorem
This is the final article in a series of four articles. Richard Karp has proven that a deterministic polynomial time solution to K-SAT will result in a deterministic polynomial time solution to all NP-Complete problems. However, it is demonstrated that a deterministic polynomial time solution to any NP-Complete problem does not necessarily produce a deterministic polynomial time solution to all...
متن کاملOn intermediate value theorem in ordered Banach spaces for noncompact and discontinuous mappings
In this paper, a vector version of the intermediate value theorem is established. The main theorem of this article can be considered as an improvement of the main results have been appeared in [textit{On fixed point theorems for monotone increasing vector valued mappings via scalarizing}, Positivity, 19 (2) (2015) 333-340] with containing the uniqueness, convergent of each iteration to the fixe...
متن کاملFaster maximum and minimum mean cycle algorithms for system-performance analysis
Maximum and minimummean cycle problems are important problems with many applications in performance analysis of synchronous and asynchronous digital systems including rate analysis of embedded systems, in discrete-event systems, and in graph theory. Karp's algorithm is one of the fastest and commonest algorithms for both of these problems. We present this paper mainly in the context of the maxi...
متن کاملIntertranslating Counterfactuals and Updates
We recall that the Ramsey Rule can be seen as axiomatising the relationship of inverse accessibility relations which exists between the notions of update and counterfactual conditional. We use this fact to translate between postulates for updates and postulates for counterfactuals. Thus, Katsuno/Mendelzon's postulates U1{U8 are translated into counterfactual postulates C1{C8 (theorem 6), and ma...
متن کاملSome Comments on Three Suggested Postulates for Quantum Theory
Three basic postulates for Quantum Theory are proposed, namely the Probability, Maximum-Speed and Hilbert-Space postulates. Subsequently we show how these postulates give rise to well-known and widely used quantum results, as the probability rule and the linearity of quantum evolution. The suggested postulates also enables us to criticize EPR elements of reality under the Special Relativity phi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/0808.3222 شماره
صفحات -
تاریخ انتشار 2008